Hierarchical Time-Dependent Oracles
نویسندگان
چکیده
We present novel oracles for networks that obey time-dependent metrics with two unique features: (i) they provably achieve subquadratic preprocessing time and space that is independent of the metric; (ii) they provably achieve query time that is sublinear either on the network size, or on the actual Dijkstra Rank of the query at hand.
منابع مشابه
(Hierarchical Identity-Based) Threshold Ring Signatures without Random Oracles
We construct the first several efficient threshold ring signatures (TRS) without random oracles. Specializing to a threshold of one, they are the first several efficient ring signatures without random oracles after the only earlier instantiation of Chow, Liu, Wei, and Yuen [22]. Further specializing to a ring of just one user, they are the short (ordinary) signatures without random oracles summ...
متن کاملConstant-Size Hierarchical Identity-Based Signature/Signcryption without Random Oracles
We construct the first constant-size hierarchical identity-based signature (HIBS) without random oracles the signature size is O(λs) bits, where λs is the security parameter, and it is independent of the number of levels in the hierarchy. We observe that an efficient hierarchical identity-based signcryption (HIBSC) scheme without random oracles can be compositioned from our HIBS and Boneh, Boye...
متن کاملPractical Hierarchical Identity Based Encryption and Signature schemes Without Random Oracles
In this paper, we propose a Hierarchical Identity Based Encryption scheme that is proven secure under the strongest model of [5] directly, without relying on random oracles. The size of the ciphertext is a constant while the size of public parameters is independent to the number of bit representing an identity. It is the first in the literature to achieve such a high security level and space ef...
متن کاملAnalysis and Experimental Evaluation of Time-Dependent Distance Oracles
Urban road networks are represented as directed graphs, accompanied by a metric which assigns cost functions (rather than scalars) to the arcs, e.g. representing time-dependent arc-traversal-times. In this work, we present oracles for providing time-dependent min-cost route plans, and conduct their experimental evaluation on a real-world data set (city of Berlin). Our oracles are based on preco...
متن کاملImproved Oracles for Time-Dependent Road Networks
A novel landmark-based oracle (CFLAT) is presented, which provides earliest-arrival-time route plans in time-dependent road networks. To our knowledge, this is the first oracle that preprocesses combinatorial structures (collections of time-stamped min-travel-time-path trees) rather than travel-time functions. The preprocessed data structure is exploited by a new query algorithm (CFCA) which al...
متن کامل